package kg.aibek.preuler1;

public class Problem7 {
	private static boolean isPrime(int number) {
		for (int i = 2; i * i <= number; i++) {
			if (number % i == 0)
				return false;
		}

		return true;
	}

	public static void main(String[] args) {
		int count = 1;
		int number = 1;
		for (int i = 3; count < 10001; i++) {
			if (isPrime(i)) {
				count++;
				number = i;
			}
		}

		System.out.println(number);
	}
}
